Cryptanalysis of Cryptmt: Effect of Huge Prime Period and Multiplicative Filter

نویسندگان

  • MAKOTO MATSUMOTO
  • MUTSUO SAITO
  • TAKUJI NISHIMURA
  • MARIKO HAGITA
چکیده

CryptMT (Cryptographic Mersenne Twister) is an 8-bit pseudorandom integer generator for a stream cipher. It combines an F2-linear generator of period 219937 − 1 and a multiplicative filter with 32-bit memory. We analyze its security against some standard cryptanalytic attacks for filter generators. It is proved that CryptMT has strong resistance against them: CryptMT has a period of 219937 − 1, the correlations among the consecutive 624-bytes of outputs are of order 2−19937, the algebraic degree of the output bits with respect to the bits in Key and IV is expected to near to the size of Key and IV. The Key size and IV size are variable, up to 2048-bit for each. We claim that CryptMT has the same security level with the minimum of the key size and the IV size. CryptMT is 1.5–2.0 times faster than the optimized AES CTR mode with 256-bit security level.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptmt Version 2.0: a Large State Generator with Faster Initialization

As a pseudorandom number generator (PRNG) for a stream cipher, we propose a combination of (1) an F2-linear generator of a wordsizeinteger sequence with huge state space, and (2) a filter with one wordsize memory, based on the accumulative integer multiplication and extracting some most significant bits from the memory. We proposed CryptMT as an example. Merits of this type of generators are (1...

متن کامل

Cryptmt Stream Cipher Version 3

In the previous manuscripts, we proposed CryptMT pseudorandom number generator (PRNG) for a stream cipher, which is a combination of (1) an F2-linear generator of a wordsize-integer sequence with a huge state space, and (2) a filter with one wordsize memory, based on the accumulative integer multiplication and extracting some most significant bits from the memory. No valid attacks have been rep...

متن کامل

A Fast Stream Cipher with Huge State Space and Quasigroup Filter for Software

Recent personal computers have high-spec CPUs and plenty of memory. The motivation of this study is to take these advantages in designing a tough and fast key-stream generator. Natural controversies on using a large state space for a generator are (1) effectiveness is unclear, (2) slower generation speed, (3) expensive initialization, and (4) costs in a hardware implementation. Our proposal is ...

متن کامل

CryptMT Stream Cipher Ver . 3 : Description ?

CryptMT Version 3 (CryptMT3) is a stream cipher obtained by combining a large LFSR and a nonlinear filter with memory using integer multiplication. Its period is proved to be no less than 219937−1, and the 8-bit output sequence is at least 1241-dimensionally equidistributed. It is one of the fastest stream ciphers on a CPU with SIMD operations, such as Intel Core 2 Duo.

متن کامل

A GENERALIZATION OF PRIME HYPERIDEALS

‎‎Let $R$ be a multiplicative hyperring‎. In this paper‎, ‎we introduce and study the concept of n-absorbing hyperideal which is a generalization‎ ‎of prime hyperideal‎. ‎A proper hyperideal $I$ of $R$ is called an $n$-absorbing hyperideal of ‎$‎R‎$‎ if whenever $alpha_1o...oalpha_{n+1} subseteq I$ for $alpha_1,...,alpha_{n+1} in R$‎, ‎then there are $n$ of the $alpha_i^,$s whose product ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005